Jump to content

Karl Reinhardt (mathematician)

From Wikipedia, the free encyclopedia
Karl August Reinhardt
BornJanuary 27, 1895 (1895-01-27)
DiedApril 27, 1941 (1941-04-28) (aged 46)
NationalityGerman
EducationGoethe Univ. Frankfurt
Known for
Scientific career
FieldsGeometry
Institutions
Thesis Über die Zerlegung der Ebene in Polygone  (1918)
Doctoral advisorLudwig Bieberbach

Karl August Reinhardt (27 January 1895 – 27 April 1941) was a German mathematician whose research concerned geometry, including polygons and tessellations. He solved one of the parts of Hilbert's eighteenth problem, and is the namesake of the Reinhardt polygons and the Reinhardt conjecture on packing density.

Life

[edit]

Reinhardt was born on January 27, 1895, in Frankfurt, the descendant of farming stock. One of his childhood friends was mathematician Wilhelm Süss. After studying at the gymnasium there, he became a student at the University of Marburg in 1913 before his studies were interrupted by World War I. During the war, he became a soldier, a high school teacher, and an assistant to mathematician David Hilbert at the University of Göttingen.[1][2]

Reinhardt completed his Ph.D. at Goethe University Frankfurt in 1918. His dissertation, Über die Zerlegung der Ebene in Polygone, concerned tessellations of the plane, and was supervised by Ludwig Bieberbach.[1][3] He began working as a secondary school teacher while working on his habilitation with Bieberbach, which he completed in 1921; titled Über Abbildungen durch analytische Funktionen zweier Veränderlicher, it concerned functional analysis.[1][2]

Bieberbach moved to Berlin in 1921, taking Süss as an assistant. They left Reinhardt in Frankfurt, working two jobs as a high school teacher and junior faculty at the university. In 1924, Reinhardt moved to the University of Greifswald as an extraordinary professor, under the leadership of Johann Radon; this gave him an income sufficient to support himself without a second job, and afforded him more time for research. He became an ordinary professor at Greifswald in 1928.[1][2]

He remained in Greifswald for the rest of his career, "with an outstanding research record and a reputation as a fine, thoughtful teacher". However, despite his now-comfortable position, his health was poor, and he died in Berlin on April 27, 1941, aged 46.[1][2]

Contributions

[edit]

In his doctoral dissertation, Reinhardt discovered the five tile-transitive pentagon tilings.[2] In a 1922 paper, Extremale Polygone gegebenen Durchmessers, he solved the odd case of the biggest little polygon problem,[4] and found the Reinhardt polygons, equilateral polygons inscribed in Reuleaux polygons that solve several related optimization problems.[5][6]

He had long been interested in Hilbert's eighteenth problem, a shared interest with Bieberbach, who in 1911 had solved a part of the problem asking for the classification of space groups. A second part of the problem asked for a tessellation of Euclidean space by a tile that is not the fundamental region of any group. In a 1928 paper, Zur Zerlegung der euklidischen Räume in kongeuente Polytope[7] Reinhardt solved this part by finding an example of such a tessellation. In a later development, Heinrich Heesch showed in 1935 that tilings with this property exist even in the two-dimensional Euclidean plane.[8]

Another of his works, Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven from 1934, constructed the smoothed octagon and conjectured that, among all centrally-symmetric convex shapes in the plane, it is the one with the lowest maximum packing density. Although the packing density of this shape is worse than the density of circle packings, Reinhardt's conjecture that it is the worst possible remains unsolved.[9]

Reinhardt also published a textbook, Methodische Einfuhrung in die Hohere Mathematik (1934). In it he presented calculus in a format reversed from the usual presentation, with areas under curves (integrals) earlier than slopes of curves (derivatives), based on his theory that the material would be easier to learn in this order.[2]

References

[edit]
  1. ^ a b c d e Maier, W. (1942), "Karl Reinhardt", Jahresbericht der Deutschen Mathematiker-Vereinigung, 52: 56, ISSN 0012-0456
  2. ^ a b c d e f O'Connor, John J.; Robertson, Edmund F., "Karl August Reinhardt", MacTutor History of Mathematics Archive, University of St Andrews
  3. ^ Karl Reinhardt at the Mathematics Genealogy Project
  4. ^ Graham, R. L. (1975), "The largest small hexagon" (PDF), Journal of Combinatorial Theory, Series A, 18 (2): 165–170, doi:10.1016/0097-3165(75)90004-7
  5. ^ Bezdek, A.; Fodor, F. (2000), "On convex polygons of maximal width", Archiv der Mathematik, 74 (1): 75–80, doi:10.1007/PL00000413, MR 1728365, S2CID 123299791
  6. ^ Hare, Kevin G.; Mossinghoff, Michael J. (2019), "Most Reinhardt polygons are sporadic", Geometriae Dedicata, 198: 1–18, arXiv:1405.5233, doi:10.1007/s10711-018-0326-5, MR 3933447, S2CID 254510721
  7. ^ Reinhardt, Karl (1928-01-01), English: 1928 mathematics paper on the decomposition of Euclidean spaces into congruent polytopes - Proceedings of the Prussian Academy of Sciences. Physical-mathematical class (PDF), retrieved 2023-11-29
  8. ^ Milnor, J. (1976), "Hilbert's problem 18: On crystallographic groups, fundamental domains, and on sphere packing", Mathematical developments arising from Hilbert problems (Northern Illinois Univ., De Kalb, Ill., 1974), Proceedings of Symposia in Pure Mathematics, vol. 28, Providence, Rhode Island: American Mathematical Society, pp. 491–506, MR 0430101
  9. ^ Hales, Thomas (2017), The Reinhardt conjecture as an optimal control problem, arXiv:1703.01352
[edit]